A Strategy for Drawing a Conceptual Neighborhood Graph Schematically
نویسنده
چکیده
Locate the relations in R1¥{r *} on the x-axis at (a, 0, 0) (a∈Z), such that the length of each link becomes two. Leave the relations that have no link with the other relations in R1. In a similar way, locate the relations in R2¥{r *} on the y-axis. For each Ci, identify R’s subset Ri that is self-symmetric with respect to Ci. Then, among the relations in Ri, identify the relation r * that has the largest number of neighbors, and place r* at (0, 0, 0).
منابع مشابه
Common Neighborhood Graph
Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملThe Common Neighborhood Graph and Its Energy
Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.
متن کاملAN EMBEDDING GRAPH FOR 9-INTERSECTION TOPOLOGICAL SPATIAL RELATIONS By
LIBRARY RIGHTS STATEMENT In presenting this thesis in partial fulfillment of the requirements for an advanced degree at the University of Maine, I agree that the Library shall make it freely available for inspection. I further agree that permission for " fair use " copying of this thesis for scholarly purposes may be granted by the Librarian. It is understood that any copying or publication of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008